Second-order duality for nondifferentiable multiobjective programming involving (Φ,ρ)-univexity
نویسندگان
چکیده
منابع مشابه
Second - Order Duality for Nondifferentiable Multiobjective Programming Involving ( , Ρ ) - Univexity
The concepts of ( , ρ)-invexity have been given by Carsiti,Ferrara and Stefanescu[32]. We consider a second-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate second-order ( , ρ)-univexity conditions. AMS 2002 Subject Classification: 90C29, 90C30, 90C46.
متن کاملNondifferentiable second order symmetric duality in multiobjective programming
A pair of Mond–Weir type nondifferentiable multiobjective second order symmetric dual programs is formulated and symmetric duality theorems are established under the assumptions of second order F-pseudoconvexity/ F-pseudoconcavity. © 2005 Elsevier Ltd. All rights reserved.
متن کاملSecond order symmetric duality in nondifferentiable multiobjective programming
A pair of Mond–Weir type second order symmetric nondifferentiable multiobjective programs is formulated. Weak, strong and converse duality theorems are established under g-pseudobonvexity assumptions. Special cases are discussed to show that this paper extends some work appeared in this area. 2004 Elsevier Inc. All rights reserved.
متن کاملNondifferentiable multiobjective second-order symmetric duality
⎯In this paper, we construct a pair of Mond-Weir type second order symmetric dual problems, in which the objective function contains support function and is, therefore, nondifferentiable. For this pair of problems, we validate weak, strong and converse duality theorems under pseudobonvexity – pseudoboncavity assumption on the kernel function that appears in the problems. A second order self dua...
متن کاملEfficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative
In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kathmandu University Journal of Science, Engineering and Technology
سال: 1970
ISSN: 1816-8752
DOI: 10.3126/kuset.v7i1.5426